A Bandwidth-Efficient Implementation of Mesh with Multiple Broadcasting
نویسندگان
چکیده
This paper presents a mesh with virtual buses as the bandwidth-efficient implementation of the mesh with multiple broadcasting on which many computational problems can be solved with reduced time complexity. The new system provides a low latency and high bandwidth communication mechanism without the disadvantage of the dual network approach: the possible bandwidth waste. The virtual buses are built using those communication links of the base point-to-point mesh network only upon request. Even if bus requests are not made, the full network bandwidth is harnessed by the point-to-point communication. On the contrary, the bandwidth assigned to the conventional real buses will be wasted when there is little bus request. This paper introduces a wormhole router design equipped with the virtual bus functions, describes the connections among these routers, and presents various virtual bus transactions. We prove the effectiveness of the virtual bus by showing that a representative semigroup computation can be solved very efficiently on it: a vector maxima finding is accelerated by 2.66 times in the experiment. We also explore the network characteristics by the distributiondriven simulation of the system. These evaluations convinced us that the mesh with virtual buses is a promising approach to low latency and high bandwidth communication which has applications in many parallel computations such as in parallel simulations, computer graphics, real time systems, and many others.
منابع مشابه
A Hop-by-Hop Multipath Routing Protocol Using Residual Bandwidth for Wireless Mesh Networks
In wireless mesh networks, there are mesh routers which can compose a wireless backbone with low mobility. We propose a hop-by-hop multipath routing scheme which is suitable for mesh routers offering network reliability with route redundancy. We extend DSDV in order to have multiple next hops to all nodes in the network without additional overheads. The basic idea of our scheme is to make sever...
متن کاملPerformance of Multi-beam Satellite Systems With A New Bandwidth Sharing Algorithm
An efficient resource allocation is important to guarantee the best performance with a fair distribution of multi-beam satellite capacity to provide satellite multimedia and broadcasting services. In this way, available bandwidth and capacity problems in new satellite system likes Multi-Input-Multi-Output (MIMO), exploring new techniques for enhancing spectral efficiency in satellite communicat...
متن کاملA Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks
Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...
متن کاملGroup-aware stream filtering for bandwidth-efficient data dissemination
In this paper 1 we are concerned with disseminating high-volume data streams to many simultaneous applications over a low-bandwidth wireless mesh network. For bandwidth efficiency, we propose a group-aware stream filtering approach, used in conjunction with multicasting, that exploits two overlooked, yet important, properties of these applications: 1) many applications can tolerate some degree ...
متن کاملOverlay Tree Maintenance in Large-Scale Dynamic Networks
The availability of high-bandwidth network connectivity and powerful, low-cost computing nodes at the network edge has fostered increasing interest in new models of distributed computation operating in an environment in which neither the computing components nor the communication infrastructure are stable. Nevertheless, developers are challenged to provide efficient and reliable applications. T...
متن کامل